Two sufficient conditions for fractional k-deleted graphs
نویسندگان
چکیده
منابع مشابه
Two sufficient conditions for fractional k-deleted graphs
Let G be a graph, and k a positive integer. A fractional k-factor is a way of assigning weights to the edges of a graph G (with all weights between 0 and 1) such that for each vertex the sum of the weights of the edges incident with that vertex is k. A graph G is a fractional k-deleted graph if G − e has a fractional k-factor for each e ∈ E(G). In this paper, we obtain some sufficient condition...
متن کاملOn fractional (k,m)-deleted graphs with constrains conditions
Let G be a graph of order n, and let k ≥ 2 and m ≥ 0 be two integers. Let h : E(G) → [0, 1] be a function. If ∑ e∋x h(e) = k holds for each x ∈ V (G), then we call G[Fh] a fractional k-factor of G with indicator function h where Fh = {e ∈ E(G) : h(e) > 0}. A graph G is called a fractional (k,m)-deleted graph if there exists a fractional k-factor G[Fh] of G with indicator function h such that h(...
متن کاملA toughness condition for fractional (k, m)-deleted graphs
In computer networks, toughness is an important parameter which is used to measure the vulnerability of the network. Zhou et al. [24] obtains a toughness condition for a graph to be fractional (k,m)–deleted and presents an example to show the sharpness of the toughness bound. In this paper we remark that the previous example does not work and inspired by this fact, we present a new toughness co...
متن کاملA neighborhood condition for fractional k-deleted graphs
Let k ≥ 3 be an integer, and let G be a graph of order n with n ≥ 9k + 3− 4 √ 2(k − 1)2 + 2. Then a spanning subgraph F of G is called a k-factor if dF (x) = k for each x ∈ V (G). A fractional k-factor is a way of assigning weights to the edges of a graph G (with all weights between 0 and 1) such that for each vertex the sum of the weights of the edges incident with that vertex is k. A graph G ...
متن کاملa neighborhood :union: condition for fractional $(k,n',m)$-critical deleted graphs
a graph $g$ is called a fractional $(k,n',m)$-critical deleted graph if any $n'$ vertices are removed from $g$ the resulting graph is a fractional $(k,m)$-deleted graph. in this paper, we prove that for integers $kge 2$, $n',mge0$, $nge8k+n'+4m-7$, and $delta(g)ge k+n'+m$, if $$|n_{g}(x)cup n_{g}(y)|gefrac{n+n'}{2}$$ for each pair of non-adjac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analele Universitatii "Ovidius" Constanta - Seria Matematica
سال: 2012
ISSN: 1844-0835
DOI: 10.2478/v10309-012-0017-4